Intransitive Trees
نویسندگان
چکیده
منابع مشابه
Intransitive Trees
We study the class of trees T on the set [1, 2, ..., n] such that for any 11i<j<kn the pairs [i, j] and [ j, k] cannot both be edges in T. We derive a formula for the number of such trees. We also give a functional equation and a differential equation for the generating function. We mention some additional combinatorial interpretations of these numbers. 1997 Academic Press 1. MAIN THEOREMS Defi...
متن کاملDynamic Intransitive Noninterference
Existing noninterference frameworks for reasoning about system security assume a fixed configuration of domains governed by a security policy that does not change over time. A static security policy, however, cannot express the domain interactions present in many modern system designs, which allow users to configure the set of active domains at runtime. In this paper, we generalize Rushby’s fra...
متن کاملWhat Is Intransitive Noninterference?
The term “intransitive noninterference” refers to the information flow properties required of systems like downgraders, in which it may be legitimate for information to flow indirectly between two users but not directly. We examine the usual definition of this property in terms of a modified purge function, and show that this is a distinctly weaker property than an alternative we derive from co...
متن کاملIntransitive Likelihood-Ratio Classifiers
In this work, we introduce an information-theoretic based correction term to the likelihood ratio classification method for multiple classes. Under certain conditions, the term is sufficient for optimally correcting the difference between the true and estimated likelihood ratio, and we analyze this in the Gaussian case. We find that the new correction term significantly improves the classificat...
متن کاملNecessary Intransitive Likelihood-Ratio Classifiers
In pattern classification tasks, errors are introduced because of differences between the true model and the one obtained via model estimation. Using likelihood-ratio based classification, it is possible to correct for this discrepancy by finding class-pair specific terms to adjust the likelihood ratio directly, and that can make class-pair preference relationships intransitive. In this work, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1997
ISSN: 0097-3165
DOI: 10.1006/jcta.1996.2735